skip to main content


Search for: All records

Creators/Authors contains: "Asgari, Ehsaneddin"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract Motivation

    Gene annotation is the problem of mapping proteins to their functions represented as Gene Ontology (GO) terms, typically inferred based on the primary sequences. Gene annotation is a multi-label multi-class classification problem, which has generated growing interest for its uses in the characterization of millions of proteins with unknown functions. However, there is no standard GO dataset used for benchmarking the newly developed new machine learning models within the bioinformatics community. Thus, the significance of improvements for these models remains unclear.

    Results

    The Gene Benchmarking database is the first effort to provide an easy-to-use and configurable hub for the learning and evaluation of gene annotation models. It provides easy access to pre-specified datasets and takes the non-trivial steps of preprocessing and filtering all data according to custom presets using a web interface. The GO bench web application can also be used to evaluate and display any trained model on leaderboards for annotation tasks.

    Availability and implementation

    The GO Benchmarking dataset is freely available at www.gobench.org. Code is hosted at github.com/mofradlab, with repositories for website code, core utilities and examples of usage (Supplementary Section S.7).

    Supplementary information

    Supplementary data are available at Bioinformatics online.

     
    more » « less
  2. null (Ed.)
    We introduce the task ofstory fragment stitching,which is the process of automatically aligning andmerging event sequences of partial tellings of astory (i.e.,story fragments). We assume that eachfragment contains at least one event from the storyof interest, and that every fragment shares at leastone event with another fragment. We propose agraph-based unsupervised approach to solving thisproblem in which events mentions are representedas nodes in the graph, and the graph is compressedusing a variant of model merging to combine nodes.The goal is for each node in the final graph to con-tain only coreferent event mentions. To find coref-erent events, we use BERT contextualized embed-ding in conjunction with atf-idfvector representa-tion. Constraints on the merge compression pre-serve the overall timeline of the story, and the finalgraph represents the full story timeline. We evalu-ate our approach using a new annotated corpus ofthe partial tellings of the story of Moses found inthe Quran, which we release for public use. Ourapproach achieves a performance of 0.63F1score 
    more » « less